Beam Search Algorithm for Anti-Collision Trajectory Planning for Many-to-Many Encounter Situations with Autonomous Surface Vehicles
نویسندگان
چکیده
منابع مشابه
Trajectory planning for autonomous underwater vehicles
1.1 Trajectory planning This chapter is a contribution to the field of Artificial Intelligence. Artificial Intelligence can be defined as the study of methods by which a computer can simulate aspects of human intelligence (Moravec, 2003). Among many mental capabilities, a human being is able to find his own path in a given environment and to optimize it according to the situation requirements. ...
متن کاملA Framework for Collision-Tolerant Optimal Trajectory Planning of Autonomous Vehicles
Collision-tolerant trajectory planning is the consideration that collisions, if they are planned appropriately, enable more effective path planning for robots capable of handling them. A mixed integer programming (MIP) optimization formulation demonstrates the computational practicality of optimizing trajectories that comprise planned collisions. A damage quantification function is proposed, an...
متن کاملDistributed Stochastic Search Algorithm for Multi-ship Encounter Situations
Ship collision avoidance involves helping ships find routes that will best enable them to avoid a collision.When more than two ships encounter each other, the procedure becomes more complex since a slight change in course by one ship might affect the future decisions of the other ships. Two distributed algorithms have been developed in response to this problem: Distributed Local Search Algorith...
متن کاملSafe Trajectory Planning of Autonomous Vehicles
This thesis presents a novel framework for safe online trajectory planning of unmanned vehicles through partially unknown environments. The basic planning problem is formulated as a receding horizon optimization problem using mixed-integer linear programming (MILP) to incorporate kino-dynamic, obstacle avoidance and collision avoidance constraints. Agile vehicle dynamics are captured through a ...
متن کاملA Monte-Carlo Algorithm for Path Planning With Many Degrees
We describe a stochastic techuique for p l d n g colllion-frec path. of robots with many deof freedom (DOF's). The algorithm incrementally builds a graph connecting the local "a of a potential function defined in the robot's configuration space and concurrently searches this graph until a goal configurationis attained. A local minimum is connected to another one by executing a random motion tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2020
ISSN: 1424-8220
DOI: 10.3390/s20154115